package org.algorithm.二师兄.链表;

import org.algorithm.biubiu.wheel_1.common.ListNode;
import org.junit.Test;

/**
 * @Date 2022/2/25
 * @Link {https://leetcode-cn.com/problems/next-greater-node-in-linked-list/}
 */
public class 链表中下一个最大的节点 {


    @Test
    public  void  test(){
        int[] ints = nextLargerNodes(ListNode.build(1, 7, 5, 1, 9, 2, 5, 1));
        System.out.println("ints = " + ints);
    }

    public int[] nextLargerNodes(ListNode head) {
        return null;
    }
}
